Efficiently Decodable Non-Adaptive Threshold Group Testing
نویسندگان
چکیده
منابع مشابه
Efficiently Decodable Non-Adaptive Threshold Group Testing
X iv :1 71 2. 07 50 9v 2 [ cs .I T ] 2 3 D ec 2 01 7 Efficiently Decodable Non-Adaptive Threshold Group Testing Thach V. Bui∗, Minoru Kuribayashi‡, Mahdi Cheraghchi§, and Isao Echizen∗† ∗SOKENDAI (The Graduate University for Advanced Studies), Hayama, Kanagawa, Japan [email protected] ‡Graduate School of Natural Science and Technology, Okayama University, Okayama, Japan [email protected] ...
متن کاملEfficient Decodable Group Testing
The basic group testing problem is to identify the unknown set of " positive items " from a large population of " items " using as few " tests " as possible. A test is a subset of items. A test returns positive if there is a positive item in the subset. The semantics of " positives, " " items, " and " tests " depend on the application. In the original context [3], group testing was invented to ...
متن کاملNon-Adaptive Group Testing on Graphs
Grebinski and Kucherov (1998) and Alon et al. (2004-2005) study the problem of learning a hidden graph for some especial cases, such as hamiltonian cycle, cliques, stars, and matchings. This problem is motivated by problems in chemical reactions, molecular biology and genome sequencing. In this paper, we present a generalization of this problem. Precisely, we consider a graph G and a subgraph H...
متن کاملNon-Adaptive Randomized Algorithm for Group Testing
We study the problem of group testing with a non-adaptive randomized algorithm in the random incidence design (RID) model where each entry in the test is chosen randomly independently from {0, 1} with a fixed probability p. The property that is sufficient and necessary for a unique decoding is the separability of the tests, but unfortunately no linear time algorithm is known for such tests. In ...
متن کاملThreshold Group Testing
We introduce a natural generalization of the well-studied group testing problem: A test gives a positive (negative) answer if the pool contains at least u (at most l) positive elements, and an arbitrary answer if the number of positive elements is between these fixed thresholds l and u. We show that the p positive elements can be determined up to a constant number of misclassifications, bounded...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2019
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2019.2907990